An Improved, Simple Construction of Many Halving Edges
نویسندگان
چکیده
We construct, for every even n, a set of n points in the plane that generates Ω ne √ ln 4· √ ln n/ √ ln n halving edges. This improves Tóth’s previous bound by a constant factor in the exponent. Our construction is significantly simpler than Tóth’s.
منابع مشابه
Halving Point Sets
Given n points in R d , a hyperplane is called halving if it has at most bn=2c points on either side. How many partitions of a point set (into the points on one side, on the hyperplane, and on the other side) by halving hyperplanes can be realized by an n-point set in R d ? Consider the following algorithmic problem rst. Given n points in R d , we want to nd a hyperplane that minimizes the sum ...
متن کاملRederiving the Upper Bound for Halving Edges using Cardano's Formula
In this paper we rederive an old upper bound on the number of halving edges present in the halving graph of an arbitrary set of n points in 2-dimensions which are placed in general position. We provide a different analysis of an identity discovered by Andrejak et al, to rederive this upper bound of O(n). In the original paper of Andrejak et al. the proof is based on a naive analysis whereas in ...
متن کاملDense point sets with many halving lines
We construct a dense point set of n points in the plane with ne( √ logn) halving lines. This improves the bound O(n log n) of Edelsbrunner, Valtr and Welzl from 1997. We also observe that the upper bound on the maximum number of halving lines of dense point set can be improved to O(n). Our construction can be generalized to higher dimensions, for any d we construct a dense point set of n points...
متن کاملGeometric Dilation and Halving Distance
Let G be a geometric graph in the plane whose edges may be curves. For two arbitrary points on its edges, we can compare the length of the shortest path in G connecting them against their Euclidean distance. The supremum of all these ratios is called the geometric dilation of G. Given a finite point set S, we would like to know the smallest possible dilation of any graph that contains the given...
متن کاملGeometric dilation and halving distance
Let G be a geometric graph in the plane whose edges may be curves. For two arbitrary points on its edges, we can compare the length of the shortest path in G connecting them against their Euclidean distance. The supremum of all these ratios is called the geometric dilation of G. Given a finite point set S, we would like to know the smallest possible dilation of any graph that contains the given...
متن کامل